| 翻訳と辞書 |
| Graph (abstract data type) ： ウィキペディア英語版 |
Graph (abstract data type)
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from mathematics.
A graph data structure consists of a finite (and possibly mutable) set of ''vertices'' or ''nodes'' or ''points'', together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as ''edges'' or ''arcs'' or ''lines'' for an undirected graph and as ''arrows'' or ''directed edges'' or ''directed arcs'' or ''directed lines'' for a directed graph. The vertices may be part of the graph structure, or may be external entities represented by integer indices or references.
A graph data structure may also associate to each edge some ''edge value'', such as a symbolic label or a numeric attribute (cost, capacity, length, etc.).
==Algorithms==
Graph algorithms are a significant field of interest within computer science. Typical higher-level operations associated with graphs are: finding a path between two vertices, like depth-first search and breadth-first search and finding the shortest path from one vertex to another, like Dijkstra's algorithm. A solution to finding the shortest path from each vertex to every other vertex also exists in the form of the Floyd–Warshall algorithm.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Graph (abstract data type)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|